A logic with higher order conditional probabilities
نویسندگان
چکیده
منابع مشابه
A Logic with Higher Order Conditional Probabilities
We investigate probability logic with the conditional probability operators. This logic, denoted LCP , allows making statements such as: P sα, CP s(α | β), CP 0(α | β) with the intended meaning “the probability of α is at least s”, “the conditional probability of α given β is at least s”, “the conditional probability of α given β at most 0”. A possible-world approach is proposed to give semanti...
متن کاملReasoning about conditional probabilities in a higher-order-logic theorem prover
In the field of probabilistic analysis, the concept of conditional probability plays a major role for estimating probabilities when some partial information concerning the result of the experiment is available. This paper presents a higher-order-logic definition of conditional probability and the formal verification of some classical properties of conditional probability, such as, the total pro...
متن کاملA Logic with Kolmogorov Style Conditional Probabilities
In this paper we investigate a probability logic with conditional probability operators. The logic (denoted LPP ) allows making statements such as CP≥s(α | β), with the intended meaning ”the conditional probability of α given β is at least s”. Conditional probabilities are defined in the usual Kolmogorv style: P (α | β) = P (α∧β) P (β) , P (β) > 0. A possible-world approach is used to give sema...
متن کاملToward Markov Logic with Conditional Probabilities
Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some subset of first-order logic are probabilistic relational models (PRMs), Bayesian logic programs (BLPs) and Markov logic networks (MLNs). Of these three formalisms, MLN is the currently most actively researched. While the ...
متن کاملToward Markov Logic with Conditional Probabilities
Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some subset of first-order logic are probabilistic relational models (PRMs), Bayesian logic programs (BLPs) and Markov logic networks (MLNs). Of these three formalisms, MLN is the currently most actively researched. While the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications de l'Institut Mathematique
سال: 2007
ISSN: 0350-1302,1820-7405
DOI: 10.2298/pim0796141o